Efficient Querying for Cooperative Probabilistic Commitments

Multiagent systems can use commitments as the core of a general coordination infrastructure, supporting both cooperative and non-cooperative interactions. Agents whose objectives are aligned, where one agent help another achieve greater reward by sacrificing some its own reward, should choose commitment to maximize their joint reward. We present solution problem how agents efficiently find an (approximately) optimal querying about carefully-selected choices. prove structural properties agents' values functions parameters specification, develop greedy method for composing query with provable approximation bounds, which we empirically show nearly in fraction time methods that lack our insights require.